Research on Self-adaptive Online Vehicle Velocity Prediction Strategy Considering Traffic Information Fusion

In order to increase the prediction accuracy of the online vehicle velocity prediction (VVP) strategy, a self-adaptive velocity prediction algorithm fused with traffic information was presented for the multiple scenarios. Initially, traffic scenarios were established inside the co-simulation environment. In addition, the algorithm of a general regressive neural network (GRNN) paired with datasets of the ego-vehicle, the front vehicle, and traffic lights was used in traffic scenarios, which increasingly improved the prediction accuracy. To ameliorate the robustness of the algorithm, then the strategy was optimized by particle swarm optimization (PSO) and k-fold cross-validation to find the optimal parameters of the neural network in real-time, which constructed a self-adaptive online PSO-GRNN VVP strategy with multi-information fusion to adapt with different operating situations. The self-adaptive online PSO-GRNN VVP strategy was then deployed to a variety of simulated scenarios to test its efficacy under various operating situations. Finally, the simulation results reveal that in urban and highway scenarios, the prediction accuracy is separately increased by 27.8% and 54.5% when compared to the traditional GRNN VVP strategy with fixed parameters utilizing only the historical ego-vehicle velocity dataset.Comment: 9 pages, 7 figure

Cross-layer optimization for cooperative content distribution in multihop device-to-device networks

With the ubiquity of wireless network and the intelligentization of machines, Internet of Things (IoT) has come to people's horizon. Device-to-device (D2D), as one advanced technique to achieve the vision of IoT, supports a high speed peer-to-peer transmission without fixed infrastructure forwarding which can enable fast content distribution in local area. In this paper, we address the content distribution problem by multihop D2D communication with decentralized content providers locating in the networks. We consider a cross-layer multidimension optimization involving frequency, space, and time, to minimize the network average delay. Considering the multicast feature, we first formulate the problem as a coalitional game based on the payoffs of content requesters, and then, propose a time-varying coalition formation-based algorithm to spread the popular content within the shortest possible time. Simulation results show that the proposed approach can achieve a fast content distribution across the whole area, and the performance on network average delay is much better than other heuristic approaches

Joint relay selection and resource allocation for energy-efficient D2D cooperative communications using matching theory

Device-to-device (D2D) cooperative relay can improve network coverage and throughput by assisting users with inferior channel conditions to implement multi-hop transmissions. Due to the limited battery capacity of handheld equipment, energy efficiency is an important issue to be optimized. Considering the two-hop D2D relay communication scenario, this paper focuses on how to maximize the energy efficiency while guaranteeing the quality of service (QoS) requirements of both cellular and D2D links by jointly optimizing relay selection, spectrum allocation and power control. Since the four-dimensional matching involved in the joint optimization problem is NP-hard, a pricing-based two-stage matching algorithm is proposed to reduce dimensionality and provide a tractable solution. In the first stage, the spectrum resources reused by relay-to-receiver links are determined by a two-dimensional matching. Then, a three-dimensional matching is conducted to match users, relays and the spectrum resources reused by transmitter-to-relay links. In the process of preference establishment of the second stage, the optimal transmit power is solved to guarantee that the D2D link has the maximized energy efficiency. Simulation results show that the proposed algorithm not only has a good performance on energy efficiency, but also enhances the average number of served users compared to the case without any relay